A Rotating-Grid Upwind Fast Sweeping Scheme for a Class of Hamilton-Jacobi Equations
نویسندگان
چکیده
We present a fast sweeping method for class of Hamilton-Jacobi equations that arise from time-independent problems in optimal control theory. The basic two dimensions uses four point stencil and is extremely simple to implement. test our against Eikonal different norms, then suggest general rotating the grid using additional approximations derivatives directions order more accurately capture characteristic flow. display utility by applying it relevant engineering.
منابع مشابه
Fast Sweeping Algorithms for a Class of Hamilton-Jacobi Equations
We derive a Godunov-type numerical flux for the class of strictly convex, homogeneous Hamiltonians that includes H(p; q) = pap2 + bq2 2 pq; 2 < ab: We combine our Godunov numerical fluxes with a simple GaussSeidel type iterations for solving the corresponding Hamilton-Jacobi Equations. The resulting algorithm is fast since it does not require a sorting strategy as does the fast marching method....
متن کاملA Fast Sweeping Method for Static Convex Hamilton-Jacobi Equations
We develop a fast sweeping method for static Hamilton-Jacobi equations with convex Hamiltonians. Local solvers and fast sweeping strategies apply to structured and unstructured meshes. With causality correctly enforced during sweepings numerical evidence indicates that the fast sweeping method converges in a finite number of iterations independent of mesh size. Numerical examples validate both ...
متن کاملLax – Friedrichs sweeping scheme for static Hamilton – Jacobi equations q
We propose a simple, fast sweeping method based on the Lax–Friedrichs monotone numerical Hamiltonian to approximate viscosity solutions of arbitrary static Hamilton–Jacobi equations in any number of spatial dimensions. By using the Lax–Friedrichs numerical Hamiltonian, we can easily obtain the solution at a specific grid point in terms of its neighbors, so that a Gauss–Seidel type nonlinear ite...
متن کاملHigh Order Fast Sweeping Methods for Static Hamilton-Jacobi Equations
We construct high order fast sweeping numerical methods for computing viscosity solutions of static Hamilton-Jacobi equations on rectangular grids. These methods combine high order weighted essentially non-oscillatory (WENO) approximation to derivatives, monotone numerical Hamiltonians and Gauss Seidel iterations with alternating-direction sweepings. Based on well-developed first order sweeping...
متن کاملFast Sweeping Methods for Static Hamilton-Jacobi Equations
We propose a new sweeping algorithm which discretizes the Legendre transform of the numerical Hamiltonian using an explicit formula. This formula yields the numerical solution at a grid point using only its immediate neighboring grid values and is easy to implement numerically. The minimization that is related to the Legendre transform in our sweeping scheme can either be solved analytically or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scientific Computing
سال: 2021
ISSN: ['1573-7691', '0885-7474']
DOI: https://doi.org/10.1007/s10915-021-01531-x